Low-Power Branch Prediction
نویسندگان
چکیده
Low-power design has gained much attention recently, especially for computing on batterypowered equipments. Reducing BTB (branch target buffer) accesses is an effective way to reduce processor power consumption, since BTB consumes a significant portion of power in a processor. In this paper, we propose two approaches to reduce BTB accesses. The first approach expects the distance of every two dynamic branch instructions to be a constant n, where n can be statically profiled, and forces BTB to repose for n instructions after a BTB hit. The second approach dynamically predicts the address of the next branch instruction, and accesses BTB only on the predicted address. Multimedia/DSP benchmarks are used in our evaluation. Experimental results show that these methods can potentially reduce 22.033% of all BTB accesses. keywords: low-power, branch prediction, branch target buffer
منابع مشابه
Low-power branch prediction techniques for VLIW architectures: a compiler-hints based approach
The paper introduces a dynamic branch prediction scheme suitable for energy-aware Very Long Instruction Word (VLIW) processors. The proposed technique is based on a compiler hint mechanism to filter the accesses to the branch predictor blocks. We define a configurable hint instruction which anticipates some static information about the upcoming branch to reduce the hardware involved in the pred...
متن کاملBranch Prediction Techniques and Optimizations
Branch prediction is one of the ancient performance improving techniques which still finds relevance into modern architectures. While the simple prediction techniques provide fast lookup and power efficiency they suffer from high misprediction rate. On the other hand, complex branch predictions – either neural based or variants of two-level branch prediction – provide better prediction accuracy...
متن کاملLow-Power Perceptron Branch Predictor
Perceptron based predictors are highly accurate. This high accuracy is the result of exploiting long history lengths [1] and is achieved at the expense of high complexity. The dot product of two vectors is used as prediction. The first vector is the branch outcome history where the second vector is composed of per branch weights, which represent the correlation between branch outcome and previo...
متن کاملAn Integrated Placement and Synthesis Approach for Timing Closure of PowerPC Microprocessors
Power Compiler: A Gate-Level Power Optimization and Synthesis System p. 74 Elastic History Buffer: A Low-Cost Method to Improve Branch Prediction Accuracy p. 82 Design Optimization for High-Speed Per-address Two-level Branch Predictors p. 88 PA-8000: A Case Study of Static and Dynamic Branch Prediction p. 97 Discrete Drive Selection for Continuous Sizing p. 110 Continuous Retiming: Algorithms a...
متن کاملContext-based Branch Prediction for High-Performance and Low-Power Computing
Advanced processors can simultaneously execute multiple instructions in parallel to achieve performance. Branches introduce control dependence between instructions. Branch prediction therefore is important to modern processors. Most present predictors use branch history to predict branch outcomes. Using branch history alone results in delay for identifying mispredictions. In this paper, a conte...
متن کامل